Gauss elimination by segments and multivariate polynomial interpolation
نویسنده
چکیده
The construction of a polynomial interpolant to data given at finite pointsets in IR (or, most generally, to data specified by finitely many linear functionals) is considered, with special emphasis on the linear system to be solved. Gauss elimination by segments (i.e., by groups of columns rather than by columns) is proposed as a reasonable means for obtaining a description of all solutions and for seeking out solutions with ‘good’ properties. A particular scheme, due to Amos Ron and the author, for choosing a particular polynomial interpolating space in dependence on the given data points, is seen to be singled out by requirements of degree-reduction, dilation-invariance, and a certain orthogonality requirement. The close connection, between this particular construction of a polynomial interpolant and the construction of an H-basis for the ideal of all polynomials which vanish at the given data points, is also discussed.
منابع مشابه
Interpolation from spaces spanned by monomials
This is an extension and emendation of recent results on the use of Gauss elimination in multivariate polynomial interpolation and, in particular, ideal interpolation. Let Π ⊂ (IF → IF) be the space of all polynomials in d real (IF = IR) or complex (IF = C) variables. Let Q be an n-row map on Π, i.e., a linear map from Π to IF, and consider the task of solving
متن کاملComputational Aspects of Polynomial Interpolation in Several Variables
The pair (6, P) of a point set 8 C R¿ and a polynomial space P on Rd is correct if the restriction map P —» E8 : p t-> P|Q is invertible, i.e., if there is, for any / defined on 0 , a unique p G P which matches /on 9. We discuss here a particular assignment 6 >-+ Fie , introduced by us previously, for which (8, lie) is always correct, and provide an algorithm for the construction of a basis for...
متن کاملUNIVERSITY OF WISCONSIN-MADISON COMPUTER SCIENCES DEPARTMENT Computational aspects of polynomial interpolation in several variables
The pair 〈Θ, P 〉 of a pointset Θ ⊂ IR and a polynomial space P on IR is correct if the restriction map P → IR : p 7→ p|Θ is invertible, i.e., if there is, for any f defined on Θ, a unique p ∈ P which matches f on Θ. We discuss here a particular assignment Θ 7→ ΠΘ, introduced in [3], for which 〈Θ,ΠΘ〉 is always correct, and provide an algorithm for the contruction of a basis for ΠΘ which is relat...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملEecient Algorithms for Multipolynomial Resultant
The multipolynomial resultant of a set of equations is fundamental in quantiier elimination over the elementary theory of real and algebraically closed elds. Earlier algorithms for resultant computation and symbolic elimination are considered slow in practice. In this paper we present eecient algorithms to compute multi-polynomial resultants and demonstrates their use for polynomial manipulatio...
متن کامل